Resource Cost Results for One-Way Entanglement Distillation and State Merging of Compound and Arbitrarily Varying Quantum Sources

نویسندگان

  • Holger Boche
  • Gisbert Janssen
چکیده

We consider one-way quantum state merging and entanglement distillation under compound and arbitrarily varying source models. Regarding quantum compound sources, where the source is i.i.d., but the source state an unknown member of a certain set of density matrices, we continue investigations begun in Ref. 7 and determine the classical as well as entanglement cost of state merging. We further investigate quantum state merging and entanglement distillation protocols for arbitrarily varying quantum sources (AVQS). In the AVQS model, the source state is assumed to vary in an arbitrary manner for each source output due to environmental fluctuations or adversarial manipulation. We determine the one-way entanglement distillation capacity for AVQS, where we invoke the famous robustification and elimination techniques introduced by R. Ahlswede. Regarding quantum state merging for AVQS we show by example, that the robustification and elimination based approach generally leads to suboptimal entanglement as well as classical communication rates.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Entanglement-assisted classical capacities of compound and arbitrarily varying quantum channels

We consider classical message transmission under entanglement assistance for compound memoryless and arbitrarily varying quantum channels. In both cases, we prove general coding theorems together with corresponding weak converse bounds. In this way, we obtain single-letter characterizations of the entanglement-assisted classical capacities for both channel models. Moreover, we show that the ent...

متن کامل

Computing quantum discord is NP-complete

We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete. Therefore, quantum discord is computationally intractable: the running time of any algorithm for computing quantum discord is believed to grow exponentially with the dimension of the Hilbert space so that computing quantum disc...

متن کامل

One-shot Multiparty State Merging

We present a protocol for performing state merging when multiple parties share a single copy of a mixed state, and analyze the entanglement cost in terms of minand maxentropies. Our protocol allows for interpolation between corner points of the rate region without the need for time-sharing, a primitive which is not available in the one-shot setting. We also compare our protocol to the more naiv...

متن کامل

Assisted entanglement distillation

Motivated by the problem of designing quantum repeaters, we study entanglement distillation between two parties, Alice and Bob, starting from a mixed state and with the help of “repeater” stations. To treat the case of a single repeater, we extend the notion of entanglement of assistance to arbitrary mixed tripartite states and exhibit a protocol, based on a random coding strategy, for extracti...

متن کامل

Entanglement distillation : a discourse on bound entanglement in quantum information theory

In recent years entanglement has been recognised as a useful resource in quantum information and computation. This applies primarily to pure state entanglement which is, due to interaction with the environment, rarely available. Decoherence provides the main motivation for the study of entanglement distillation. A remarkable effect in the context of distillation is the existence of bound entang...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1401.6063  شماره 

صفحات  -

تاریخ انتشار 2014